Existence, algorithms, and asymptotics of direct product decompositions, I
نویسندگان
چکیده
منابع مشابه
Existence, algorithms, and asymptotics of direct product decompositions, I
Direct products of finite groups are a simple method to construct new groups from old ones. A difficult problem by comparison is to prove a generic group G is indecomposable, or locate a proper nontrivial direct factor. To solve this problem it is shown that in most circumstances G has a proper nontrivial subgroup M such that every maximal direct product decomposition Q of G/M induces a unique ...
متن کاملCanonical tree-decompositions of finite graphs I. Existence and algorithms
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject to the requirement that they commute with graph isomorphisms. In particular, all the decompositions constructed are invariant under the automorphisms of the...
متن کاملDirect Product Decompositions of Lattices , Closures andRelation
In this paper we study the direct product decompositions of closure operations and lattices of closed sets. We characterize the direct product decompositions of lattices of closed sets in terms of closure operations, and nd those decompositions of lattices which correspond to the decompositions of closures. If a closure on a nite set is represented by its implication base (i.e. a binary relatio...
متن کاملDirect Product Decompositions of Infinitely Distributive Lattices
Let α be an infinite cardinal. Let Tα be the class of all lattices which are conditionally α-complete and infinitely distributive. We denote by T ′ σ the class of all lattices X such that X is infinitely distributive, σ-complete and has the least element. In this paper we deal with direct factors of lattices belonging to Tα. As an application, we prove a result of Cantor-Bernstein type for latt...
متن کاملDirect product decompositions of lattices, closures and relation schemes
In this paper we study direct product decompositions of closure operations and lattices of closed sets. We characterize direct product decompositions of lattices of closed sets in terms of closure operations, and find those decompositions of lattices which correspond to the decompositions of closures. If a closure on a finite set is represented by its implication base (i.e. a binary relation on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups - Complexity - Cryptology
سال: 2012
ISSN: 1867-1144,1869-6104
DOI: 10.1515/gcc-2012-0007